Almost sure convergence, convergence in probability and asymptotic normality

ثبت نشده
چکیده

In the previous chapter we considered estimator of several different parameters. The hope is that as the sample size increases the estimator should get ‘closer’ to the parameter of interest. When we say closer we mean to converge. In the classical sense the sequence {xk} converges to x (xk → x), if |xk − x| → 0 as k → ∞ (or for every ε > 0, there exists an n where for all k > n, |xk − x| < ε). Of course the estimators we have considered are random, that is for every ω ∈ Ω (set of all out comes) we have an different estimate. The natural question to ask is what does convergence mean for random sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Sure Convergence of Kernel Bivariate Distribution Function Estimator under Negative Association

Let {Xn&nbsp;,n=>1} be a strictly stationary sequence of negatively associated random variables, with common distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1, Xk+1)&nbsp;for fixed $K /in N$ based on kernel type estimators. We introduce asymptotic normality and properties and moments. From these we derive the optimal bandwidth...

متن کامل

The eccentric connectivity index of bucket recursive trees

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

متن کامل

On the asymptotic behavior of the Durbin-Watson statistic for ARX processes in adaptive tracking

A wide literature is available on the asymptotic behavior of the Durbin-Watson statistic for autoregressive models. However, it is impossible to find results on the Durbin-Watson statistic for autoregressive models with adaptive control. Our purpose is to fill the gap by establishing the asymptotic behavior of the Durbin Watson statistic for ARX models in adaptive tracking. On the one hand, we ...

متن کامل

Asymptotic Properties of Some Projection-based Robbins-Monro Procedures in a Hilbert Space

Let H be an infinite-dimensional real separable Hilbert space. Given an unknown mapping M :H (r)H that can only be observed with noise, we consider two modified Robbins-Monro procedures to estimate the zero point ?o ( H of M. These procedures work in appropriate finite dimensional sub-spaces of growing dimension. Almost-sure convergence, functional central limit theorem (hence asymptotic normal...

متن کامل

Repair Efficiency Estimation in the Ari1 Imperfect Repair Model

Abstract The aim of this paper is to study the estimation of repair efficiency in an imperfect repair model, called Arithmetic Reduction of Intensity model with memory one (ARI1). This model, first introduced by Doyen and Gaudoin, has a very simple failure intensity and repair efficiency is characterized by a single parameter. Thanks to that simplicity, the asymptotic almost sure behavior of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008